51![On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4 On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4](https://www.pdfsearch.io/img/24542993f979b17067e5b16630e68a51.jpg) | Add to Reading ListSource URL: rutcor.rutgers.eduLanguage: English - Date: 2014-04-14 14:04:38
|
---|
52![Being prepared in a sparse world: the case of KNN graph construction Antoine Boutet Anne-Marie Kermarrec Being prepared in a sparse world: the case of KNN graph construction Antoine Boutet Anne-Marie Kermarrec](https://www.pdfsearch.io/img/557d1985fa2256f62be9f2966bfe0606.jpg) | Add to Reading ListSource URL: womencourage.acm.orgLanguage: English - Date: 2016-08-09 09:13:46
|
---|
53![Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind† Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†](https://www.pdfsearch.io/img/31492bffa0f1271dc0fbda8d46292924.jpg) | Add to Reading ListSource URL: www.levreyzin.comLanguage: English - Date: 2016-07-01 10:19:11
|
---|
54![P ERSEUS 3: Visualizing and Interactively Mining Large-Scale Graphs Di Jin Ticha Sethapakdi P ERSEUS 3: Visualizing and Interactively Mining Large-Scale Graphs Di Jin Ticha Sethapakdi](https://www.pdfsearch.io/img/28cc02735f7e1868f1dcba98c2324c84.jpg) | Add to Reading ListSource URL: www.mlgworkshop.orgLanguage: English - Date: 2016-08-14 01:22:56
|
---|
55![111 Documenta Math. On the Structure of Covers of Sofic Shifts Rune Johansen 111 Documenta Math. On the Structure of Covers of Sofic Shifts Rune Johansen](https://www.pdfsearch.io/img/cc7f7d6ec2a6ab37f867d3288356c0d2.jpg) | Add to Reading ListSource URL: documenta.sagemath.orgLanguage: English - Date: 2011-04-22 12:51:16
|
---|
56![CS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes Tim Roughgarden & Gregory Valiant∗ June 1, 2016 In the first lecture of CS168, we talked about modern techniques in data storage (consistent hashing). S CS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes Tim Roughgarden & Gregory Valiant∗ June 1, 2016 In the first lecture of CS168, we talked about modern techniques in data storage (consistent hashing). S](https://www.pdfsearch.io/img/269a5057c0128d17171de605d16dd791.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2016-06-04 09:49:43
|
---|
57![A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One Markus Bl¨ aser Institut f¨ ur Theoretische Informatik, ETH Z¨ A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One Markus Bl¨ aser Institut f¨ ur Theoretische Informatik, ETH Z¨](https://www.pdfsearch.io/img/f2663d773ede0edfc9ee8e952a218184.jpg) | Add to Reading ListSource URL: www-cc.cs.uni-saarland.deLanguage: English - Date: 2013-08-22 13:00:35
|
---|
58![Modes and Cuts in Metabolic Networks: Complexity and Algorithms∗ Vicente Acu˜ na2,3 , Flavio Chierichetti1 , Vincent Lacroix2,3,6 , Alberto Marchetti-Spaccamela1 , Marie-France Sagot2,3 , Leen Stougie4,5 Modes and Cuts in Metabolic Networks: Complexity and Algorithms∗ Vicente Acu˜ na2,3 , Flavio Chierichetti1 , Vincent Lacroix2,3,6 , Alberto Marchetti-Spaccamela1 , Marie-France Sagot2,3 , Leen Stougie4,5](https://www.pdfsearch.io/img/3b0b51fd8168ed36d6251b98b1952c2b.jpg) | Add to Reading ListSource URL: pbil.univ-lyon1.frLanguage: English - Date: 2008-10-22 02:35:19
|
---|
59![1 International Workshop on Web Intelligence and Virtual EnterprisesA comparative study of social network analysis tools 1 International Workshop on Web Intelligence and Virtual EnterprisesA comparative study of social network analysis tools](https://www.pdfsearch.io/img/d8af01f95e1db2b8b992d6911f1a8b10.jpg) | Add to Reading ListSource URL: wic.litislab.frLanguage: English - Date: 2013-12-09 08:25:56
|
---|
60![On Crown-free Set Families, Diffusion State Difference, and Non-uniform Hypergraphs Edward Boehnlein Let La(n, H) denote the cardinality of the largest family on the Boolean lattice that does not contain H as a subposet. On Crown-free Set Families, Diffusion State Difference, and Non-uniform Hypergraphs Edward Boehnlein Let La(n, H) denote the cardinality of the largest family on the Boolean lattice that does not contain H as a subposet.](https://www.pdfsearch.io/img/b54049115d86b10e967239c0e6348195.jpg) | Add to Reading ListSource URL: www.gradschool.sc.eduLanguage: English - Date: 2016-08-01 11:18:55
|
---|